Deadlock Prevention in Distributed Object Oriented Systems
نویسندگان
چکیده
This paper proposes a deadlock prevention algorithm for Distributed Object Oriented Systems (DOOS) based on the popular resource ordering technique. In distributed object oriented system, objects are the resources requested by the transactions. Though resource-ordering technique is not new, novelty of the proposed deadlock prevention algorithm lies in exploiting the relationships among objects present in the domain to do the resource ordering. In this paper a resource ordering technique based on semantics of the object relationships like inheritance, aggregation and association is proposed. A formal model of the resource ordering technique is defined using predicate calculus.
منابع مشابه
The A ected Set Priority Ceiling Protocols for Real-Time Object-Oriented Concurrency Control
This paper presents two concurrency control protocols for real-time object-oriented systems. One of the protocols (A ected Set Priority Ceiling Protocol) is designed for single-node systems, and the other (Distributed A ected Set Priorityt Ceiling Protocol) is designed for distributed systems. Both protocols combine features of semantic concurrency control for added concurrency, with priority c...
متن کاملPreventing Recursion Deadlock in Concurrent Object-Oriented Systems
This paper presents solutions to the problem of deadlock due to recursion in concurrent object-oriented programming languages. Two language-independent, system-level mechanisms for solving this problem are proposed: a novel technique using multi-ported objects, and a named-threads scheme that borrows from previous work in distributed computing. We compare the solutions and present an analysis o...
متن کاملCreol: A type-safe object-oriented model for distributed concurrent systems
Object-oriented distributed computing is becoming increasingly important for critical infrastructure in society. In standard object-oriented models, objects synchronize on method calls. These models may be criticized in the distributed setting for their tight coupling of communication and synchronization; network delays and instabilities may locally result in much waiting and even deadlock. The...
متن کاملResolution of Deadlocks in Object-Oriented Distributed Systems
The use of locks on objects to enforce correct scheduling of concurrent transactions gives rise to deadlock situations. We propose and prove correct a distributed algorithm for detection and resolutions of resource deadlocks in object-oriented distributed systems. In particular, the algorithm can be used in conjunction with concurrency control algorithms which are based on the semantic lock mod...
متن کاملAn efficient deadlock prevention approach for service oriented transaction processing
Transaction processing can guarantee the reliability of business applications. Locking resources is widely used in distributed transaction management (e.g., two phase commit, 2PC) to keep the system consistent. The lockingmechanism, however, potentially results in various deadlocks. In service oriented architecture (SOA), the deadlock problem becomes even worse because multiple (sub)transaction...
متن کامل